A Neural Graph Isomorphism Algorithm based on local Invariants
نویسندگان
چکیده
منابع مشابه
Algebraic Combinatorics in Mathematical Chemistry
This paper deals with graph invariants and stabilization procedures. We consider colored graphs and their automorphisms and we discuss the isomorphism problem for such graphs. Various global and local isomorphism invariants are introduced. We study canonical numberings, invariant partitions, stable and equitable partitions and algorithms for stabilizing partitions.
متن کاملAn Approach of Graph Isomorphism Detection based on Vertex-Invariant
Graph Isomorphism is a widely studied problem due to its practical applications in various fields of networks, chemistry and finger print detection, recent problems in biology such as diabetes detection, protein structure and information retrieval. An approach to the graph isomorphism detection is based on vertex invariant. In the existing approach vertex invariants is used to partition the mat...
متن کاملParallelization of Graph Isomorphism using OpenMP
Advancement in computer architecture leads to parallelize the sequential algorithm to exploit the concurrency provided by multiple core on single chip. Sequential programs do not gain performance from multicore. For multicore architectures, OPENMP and MPI are application programming interfaces. They can be used for parallelization of codes. For shared memory architecture OPENMP is used, whereas...
متن کاملNew Invariants for the Graph Isomorphism Problem
In this paper we introduce a novel polynomial-time algorithm to compute graph invariants based on the modified random walk idea on graphs. However not proved to be a full graph invariant by now, our method gives the right answer for the graph instances other wellknown methods could not compute (such as special Fürer Gadgets and point-line incidence graphs of finite projective planes of higher d...
متن کاملFast Practical Algorithm Based on Weisfeiler-lehman Method for Graph Isomorphism
Graph isomorphism problem is to determine whether two given graphs are isomorphic. It is a particular type of a more general problem “the isomorphism of incidence system”. I propose some new invariants for heuristic search of graph isomorphism and demonstrate that they are really useful in practice by experiments. Keyword. graph isomorphism, graph invariant, graph spectrum , adjacency matrix, m...
متن کامل